FLP answer set semantics without circular justifications for general logic programs

The answer set semantics presented by Faber et al. (2011) has been widely used to define so called FLP answer sets for different types of logic programs. However, it was recently observed that when being extended from normal to more general classes of logic programs, this approach may produce answer sets with circular justifications that are caused by self-supporting loops. The main reason for this behavior is that the FLP answer set semantics is not fully constructive by a bottom up construction of answer sets. In this paper, we overcome this problem by enhancing the FLP answer set semantics with a level mapping formalism such that every answer set I can be built by fixpoint iteration of a one-step provability operator (more precisely, an extended van Emden-Kowalski operator for the FLP reduct fΠ). This is inspired by the fact that under the standard answer set semantics, each answer set I of a normal logic program Π is obtainable by fixpoint iteration of the standard van Emden-Kowalski one-step provability operator for the Gelfond-Lifschitz reduct Π , which induces a level mapping. The enhanced FLP answer sets, Email addresses: [email protected] (Yi-Dong Shen), [email protected] (Kewen Wang), [email protected] (Jun Deng), [email protected] (Christoph Redl), [email protected] (Thomas Krennwallner), [email protected] (Thomas Eiter), [email protected] (Michael Fink) ∗ This article contains revised and significantly extended work presented at IJCAI2011 (Shen, 2011) and AAAI-2012 (Shen and Wang, 2012). Preprint submitted to Elsevier November 10, 2013 which we call well-justified FLP answer sets, are thanks to the level mapping free of circular justifications. As a general framework, the well-justified FLP answer set semantics applies to logic programs with first-order formulas, logic programs with aggregates, description logic programs, hex-programs etc., provided that the rule satisfaction is properly extended to such general logic programs. We study in depth the computational complexity of FLP and welljustified FLP answer sets for general classes of logic programs. Our results show that the level mapping does not increase the worst-case complexity of FLP answer sets. Furthermore, we describe an implementation of the well-justified FLP answer set semantics, and report about an experimental evaluation, which indicates a potential for performance improvements by the level mapping in practice.